Some problems on approximation of set of points by polygonal curves
نویسندگان
چکیده
Several fundamental problems in Computational Geometry come from the eld of Facility Location. In this paper we consider some problems that belong to the interplay between these two areas. Given a set S of points in the plane: (1) nd a polygonal chain with one corner belonging to S such that minimizes the maximum distance, (2) nd a polygonal chain with k corners belonging to S such that minimizes the maximum distance, (3) nd a polygonal chains with constrained length such that minimizes the maximum distance. Many more similar problems are studied in 2]
منابع مشابه
Fitting rectilinear polygonal curves to a set of points in the plane
In this paper two problems of ®tting rectilinear polygonal curves to a set of points in the plane according to the minimax approximation are considered. The constraints are, respectively, on the number of vertices and length of the polygonal curve. In both cases ecient algorithms are developed.
متن کاملA new iterative approach for dominant points extraction in planar curves
In this paper the problem of dominant point detection on digital curves is addressed. Based on an initial set of curvature points, our approach adds iteratively significant points by looking for the higher curvature contour points. The process continues until all the sums of the distances of contour points in the arcs subtended to the chord between two next dominant points is less then a predef...
متن کاملDegree Reduction of Disk Wang-Bézier Type Generalized Ball Curves
A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...
متن کاملA fast iterative method for dominant points detection of digital curves
A new algorithm for detecting dominant points of digitized closed curves is presented. At first a process of localization of maximum curvature points is done. The method adds iteratively contour points as dominant points by a criterion that considers the distance of contour points respect to the set of dominant points calculated in previous steps. It follows a final process of refinement. The p...
متن کاملPolygonal approximation of digital planar curves through adaptive optimizations
In this paper, we present a novel non-parametric polygonal approximation algorithm for digital planar curves. The proposed algorithm first selects a set of points (called cut-points) on the contour which are of very ‘high’ curvature. An optimization procedure is then applied to find adaptively the best fitting polygonal approximations for the different segments of the contour as defined by the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998